Consecutive integers with equally many principal divisors

Title: Consecutive integers with equally many principal divisors
Creator: Eggleton, Roger B.; MacDougall, James A.
Relation: Mathematics Magazine Vol. 81, Issue 4, p. 235-248
Relation: http://www.maa.org/pubs/mag_oct08_toc.html
Publisher: Mathematical Association of America
Resource Type: journal article
Date: 2008
Description: The Fundamental Theorem of Arithmetic is usually stated in a form emphasizing how primes enter the structure of the positive integers, such as: Every positive integer is the product of a unique finite multiset of primes. Alternatively, the Fundamental Theorem of Arithmetic can be stated in a form that focuses on how maximal prime-powers enter the structure of the positive integers, such as: Every positive integer is the product of a unique finite set of powers of distinct primes. Here, Eggleton and MacDougall classify positive integers by the number of principal divisors they possess, where they define a principal divisor of a positive integer n to be any prime-power divisor psupa |n which is maximal. They found that for every n greater than or less than 1 there are only finitely many runs of size greater than N in Psubn, where N is the product of the first n primes.
Subject: prime numbers; theorems; number theory; mathematics education
Identifier: uon:5577
Identifier: http://hdl.handle.net/1959.13/43478
Identifier: ISSN:0025-570X
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			SOURCE1	Author final version	660 KB	Adobe Acrobat PDF	View Details Download